Optical Network Design with Optical Constraints in IP/WDM Networks

In this paper we consider algorithms for the logical topology design and traffic grooming problem in WDM networks with router interface constraints as well as optical constraints. The optical constraints include restricted transmission range due to optical impairments as well as limits on the number of available wavelengths. We formulate this problem as an integer linear program which is NP-complete. We then introduce heuristic algorithms which use a graphical modeling tool called the Virtual Neighbor Graph and add lightpaths sequentially. The best performing heuristic uses a so-called Resource Efficiency Factor to determine the order in which paths are provisioned for the traffic demands. By giving priority to demands that can be routed over paths that make efficient use of network resources, it is able to achieve good performance both in terms of weighted hop count and network throughput. For finding optimal multi-hop paths sequentially, we introduce interface constraint shortest path problem and solve it using minimum weight perfect matching. key words: logical topology, traffic grooming, optical impairments, Interface constraints, Resource Efficiency Factor